On the theta correspondence for $(\mathrm {GSp}(4), \mathrm {GSO}(4,2))$ and Shalika periods
نویسندگان
چکیده
منابع مشابه
Modal $\mathrm{I}\mathrm{n}\mathrm{t}\mathrm{u}\mathrm{i}\mathrm{t}\mathrm{i}\mathrm{o}\mathrm{n}\tilde{\mathrm{l}}\mathrm{s}\mathrm{t}\mathrm{i}\mathrm{C}$ Logics and Predicate Superintuitionistic Logics: $\mathrm{C}_{0\Gamma \mathrm{r}\mathrm{e}..\mathrm{S}},\mathrm{p}$
In this note we deal with intuitionistic modal logics over $\mathcal{M}\mathcal{I}PC$ and predicate superintuitionistic logics. We study the correspondence between the lattice of all (normal) extensions of MTPC and the lattice of all predicate superintuitionistic logics. Let $\mathrm{L}_{Prop}$ denote a propositional language which contains two modal operators $\square$ and $\mathrm{O}$ , and $...
متن کاملON THE THETA CORRESPONDENCE FOR (GSp(4),GSO(4, 2)) AND SHALIKA PERIODS
We consider both local and global theta correspondences for GSp4 and GSO4,2. Because of the accidental isomorphism PGSO4,2 PGU2,2, these correspondences give rise to those between GSp4 and GU2,2 for representations with trivial central characters. In the global case, using this relation, we characterize representations with trivial central character, which have Shalika period on GU(2, 2) by the...
متن کامل$\mathrm{Pal}^k$ Is Linear Recognizable Online
Given a language L that is online recognizable in linear time and space, we construct a linear time and space online recognition algorithm for the language L ·Pal, where Pal is the language of all nonempty palindromes. Hence for every fixed positive k, Pal is online recognizable in linear time and space. Thus we solve an open problem posed by Galil and Seiferas in 1978.
متن کاملThe Theta Correspondence for Similitudes
In this paper we investigate the theta correspondence for similitudes over a nonarchimedean local field. We show that the two main approaches to a theta correspondence for similitudes from the literature are essentially the same, and we prove that a version of strong Howe duality holds for both constructions. Suppose that k is a nonarchimedean local field, X is a finite dimensional nondegenerat...
متن کاملApproximately Counting H-Colorings is $\#\mathrm{BIS}$-Hard
We examine the computational complexity of approximately counting the list H-colourings of a graph. We discover a natural graph-theoretic trichotomy based on the structure of the graph H . If H is an irreflexive bipartite graph or a reflexive complete graph then counting list H-colourings is trivially in polynomial time. Otherwise, if H is an irreflexive bipartite permutation graph or a reflexi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Representation Theory of the American Mathematical Society
سال: 2014
ISSN: 1088-4165
DOI: 10.1090/s1088-4165-2014-00451-5